Maximum intensity projection by 3-dimensional seed filling in view lattice

In this paper we evaluate the performance of a seed lling algorithm operating in view lattice when rendering maximum intensity projections (MIP). We evaluate the combination of the seed lling algorithm and the template algorithm. We show that the template algorithm is a particularly attractive companion to the seed lling algorithm, because the template algorithm allows stepping in all six directions within the resampled data set with very few instructions and without conditional branches. The results also indicate that given a reasonable low-level threshold for empty voxels the MIP projection can be calculated in real time with standard desktop workstations. In addition we observe that the performance of our seed lling algorithm stays relatively constant with diierent viewing angles, as opposed to the template algorithm alone.